Semantic Characterization of Kracht Formulas
نویسنده
چکیده
Kracht formulas are first-order correspondents of modal Sahlqvist formulas. In this paper we present a model-theoretic characterization of Kracht formulas similar to Van Benthem’s theorem saying that a first-order formula is equivalent to a modal formula iff it is invariant under bisimulation. Our characterization yields a method to prove that a given first-order formula is not equivalent to any Kracht formula. In particular, we prove that the first-order formula, expressing the ‘cubic property’ of a 3-dimensional modal frame does not have a Kracht equivalent.
منابع مشابه
Towards a Contrastive Pragmatic Analysis of Congratulation Speech Act in Persian and English
This paper aims at studying the speech act of congratulation in Persian and English with regard to semantic formulas. To gather the semantic formulas related to congratulation, the researchers chose 100 movies (50 in Persian and 50 in English) as the instrument of the study. The only model of cross-cultural comparison was related to that of Elwood (2004). Therefore, we used Elwood’s model as th...
متن کاملUnified Correspondence as a Proof-Theoretic Tool
The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and exploited by Marcus Kracht, in the context of his characterization of the modal axioms (which he calls primitive formulas) which can be effectively transfor...
متن کاملCross-Cultural Differences and Pragmatic Transfer in English and Persian Refusals
This study aimed to examine cross-cultural differences in performing refusal of requests between Persian native speakers (PNSs) and English native speakers (ENSs) in terms of the frequency of the semantic formulas. Also examined in this study was whether Persian EFL learners would transfer their L1 refusal patterns into the L2, and if there would be a relation between their proficiency level an...
متن کاملArgument Structure as an Interface Between Form and Meaning
A. In this paper we argue for a specific form of semantic representations, which pair together a DRS with a list of statements that declare how the variables occurring in the DRS are to be handled under merge. This eliminates the need for an external accounting device. Additionally, it greatly simplifies the amount of structure needed to account for the behaviour of contextually determin...
متن کاملTypability in Partial Applicative Structures
Adapting a claim of Kracht (Theor Comput Sci 354:131–141, 2006), we establish a characterization of the typable partial applicative structures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010